Equational reasoning with context-free families of string diagrams

String diagrams provide an intuitive language for expressing networks of interacting processes graphically. A discrete representation of string diagrams, called string graphs, allows for mechanised equational reasoning by double-pushout rewriting. However, one often wishes to express not just single equations, but entire families of equations between diagrams of arbitrary size. To do this we define a class of context-free grammars, called B-ESG grammars, that are suitable for defining entire families of string graphs, and crucially, of string graph rewrite rules. We show that the language-membership and match-enumeration problems are decidable for these grammars, and hence that there is an algorithm for rewriting string graphs according to B-ESG rewrite patterns. We also show that it is possible to reason at the level of grammars by providing a simple method for transforming a grammar by string graph rewriting, and showing admissibility of the induced B-ESG rewrite pattern.Comment: International Conference on Graph Transformation, ICGT 2015. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-21145-9_

On Leśniewski’s Characteristica Universalis

Leśniewski's systems deviate greatly from standard logic in some basic features. The deviant aspects are rather well known, and often cited among the reasons why Leśniewski's work enjoys little recognition. This paper is an attempt to explain why those aspects should be there at all. Leśniewski built his systems inspired by a dream close to Leibniz's characteristica universalis: a perfect system of deductive theories encoding our knowledge of the world, based on a perfect language. My main claim is that Leśniewski built his characteristica universalis following the conditions of de Jong and Betti's Classical Model of Science (2008) to an astounding degree. While showing this I give an overview of the architecture of Leśniewski's systems and of their fundamental characteristics. I suggest among others that the aesthetic constraints Leśniewski put on axioms and primitive terms have epistemological relevance. © The Author(s) 2008

A method for finding new sets of axioms for classes of semigroups

We introduce a general technique for finding sets of axioms for a given class of semigroups. To illustrate the technique, we provide new sets of defining axioms for groups of exponent n, bands, and semilattices

The Class of All Natural Implicative Expansions of Kleene’s Strong Logic Functionally Equivalent to Łukasiewicz’s 3-Valued Logic Ł3

25 p.We consider the logics determined by the set of all natural implicative expansions of Kleene’s strong 3-valued matrix (with both only one and two designated values) and select the class of all logics functionally equivalent to Łukasiewicz’s 3-valued logic Ł3. The concept of a “natural implicative matrix” is based upon the notion of a “natural conditional” defined in Tomova (Rep Math Log 47:173–182, 2012).S

A modal theorem-preserving translation of a class of three-valued logics of incomplete information

International audienceThere are several three-valued logical systems that form a scattered landscape, even if all reasonable connectives in three-valued logics can be derived from a few of them. Most papers on this subject neglect the issue of the relevance of such logics in relation with the intended meaning of the third truth-value. Here, we focus on the case where the third truth-value means unknown, as suggested by Kleene. Under such an understanding, we show that any truth-qualified formula in a large range of three-valued logics can be translated into KD as a modal formula of depth 1, with modalities in front of literals only, while preserving all tautologies and inference rules of the original three-valued logic. This simple information logic is a two-tiered classical propositional logic with simple semantics in terms of epistemic states understood as subsets of classical interpretations. We study in particular the translations of Kleene, Gödel, ᴌukasiewicz and Nelson logics. We show that Priest’s logic of paradox, closely connected to Kleene’s, can also be translated into our modal setting, simply by exchanging the modalities possible and necessary. Our work enables the precise expressive power of three-valued logics to be laid bare for the purpose of uncertainty management

Identification of fish remains from early mediaeval layers of the Vegetable Market excavation site in Szczecin, Poland

Background. Considerable amounts of fish bones and scales were discovered in 1953-1963, in an archaeological excavation pit situated in a former Vegetable Market in Szczecin, on the left bank of River Odra.Materials and methods. Bone remains comprising 725 labelled collections from various dated sediment layers were identified. Individual bones were compared to those of corresponding extant fish species from water bodies near Szczecin and were identified to bone type and assigned to species. The scales were identified as well.Results. A total of 10 085 (76.2%) bone remains, out of 13 229, could be identified. They belonged to 20 fish species. Most abundant were remains of carp bream (Abramis brama), zander (Sander lucioperca), roach (Rutilus rutilus), tench (Tinca tinca), wels catfish (Silurus glanis), European perch (Perca fluviatilis), northern pike (Esox lucius), and sturgeon (Acipenser sturio).Conclusion. The majority of fish species targeted by early-mediaeval fishermen are also very important in the present-day fisheries in the area. It can be presumed that intensive sturgeon fishery in early Middle Ages markedly contributed to the species′ extinction from the area